Sequential Compact Code Learning for Unsupervised Image Hashing
نویسندگان
چکیده
منابع مشابه
Sequential Projection Learning for Hashing with Compact Codes
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing methods either use random projections or extract principal directions from the data to derive hash functions. The resulting embedding suffers from poor discrimination when compact codes are used. In this paper, we propose a...
متن کاملCompact and Robust Image Hashing
Image hashing is an alternative approach to many applications accomplished with watermarking. In this paper, we propose a novel image hashing method in the DCT Domain which can be directly extended to MPEG video without DCT transforms. A key goal of the method is to produce randomized hash signatures which are unpredictable for unauthorized users, thereby yielding properties akin to cryptograph...
متن کاملUnsupervised Learning of Compositional Sparse Code for Natural Image Representation
This article proposes an unsupervised method for learning compositional sparse code for representing natural images. Our method is built upon the original sparse coding framework where there is a dictionary of basis functions often in the form of localized, elongated and oriented wavelets, so that each image can be represented by a linear combination of a small number of basis functions automat...
متن کاملDeep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning
Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...
متن کاملUnsupervised Nonlinear Hashing Using Nyström Method with Improved Sequential Projection Learning
Hashing is becoming a popular and effective method for nearest neighbor search in large-scale databases, due to its computational and memory efficient. In this paper, we present an efficient unsupervised nonlinear hashing method to transform high-dimensional data to low-dimensional binary data for fast retrieval. Firstly, we use the Nyström method to transform the feature space into nonlinear k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2016
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2015.2495345